Galerkin method with splines for total variation minimization
نویسندگان
چکیده
منابع مشابه
Discontinuous Galerkin Method for Total Variation Minimization on Inpainting Problem
This paper is concerned with the numerical minimization of energy functionals in BV (Ω) (the space of bounded variation functions) involving total variation for gray-scale 1-dimensional inpainting problem. Applications are shown by finite element method and discontinuous Galerkin method for total variation minimization. We include the numerical examples which show the different recovery image b...
متن کاملA Discontinuous Galerkin Method for Solving Total Variation Minimization Problems
The minimization of functionals which are formed by an L2-term and a Total Variation (TV) term play an important role in mathematical imaging with many applications in engineering, medicine and art. The TV term is well known to preserve sharp edges in images. More precisely, we are interested in the minimization of a functional formed by a discrepancy term and a TV term. The first order derivat...
متن کاملAlternating Minimization Method for Total Variation Based Wavelet Shrinkage Model
In this paper, we introduce a novel hybrid variational model which generalizes the classical total variation method and the wavelet shrinkage method. An alternating minimization direction algorithm is then employed. We also prove that it converges strongly to the minimizer of the proposed hybrid model. Finally, some numerical examples illustrate clearly that the new model outperforms the standa...
متن کاملA Fast Total Variation Minimization Method for Image Restoration
In this talk, we study a fast total variation minimization method for image restoration. In the proposed method, we use the exact total variation minimization scheme to denoise the deblurred image. An alternating minimization algorithm is employed to solve the proposed total variation minimization problem. Our experimental results show that the quality of restored images by the proposed method ...
متن کاملA convergent overlapping domain decomposition method for total variation minimization
In this paper we are concerned with the analysis of convergent sequential and parallel overlapping domain decomposition methods for the minimization of functionals formed by a discrepancy term with respect to the data and a total variation constraint. To our knowledge, this is the first successful attempt of addressing such a strategy for the nonlinear, nonadditive, and nonsmooth problem of tot...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algorithms & Computational Technology
سال: 2019
ISSN: 1748-3026,1748-3026
DOI: 10.1177/1748301819833046